A spectral factorization algorithm for discrete-time descriptor systems via generalized eigenproblems
نویسندگان
چکیده
منابع مشابه
Partial Eigenvalue Assignment in Discrete-time Descriptor Systems via Derivative State Feedback
A method for solving the descriptor discrete-time linear system is focused. For easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. Then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. In partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...
متن کاملpartial eigenvalue assignment in discrete-time descriptor systems via derivative state feedback
a method for solving the descriptor discrete-time linear system is focused. for easily, it is converted to a standard discrete-time linear system by the definition of a derivative state feedback. then partial eigenvalue assignment is used for obtaining state feedback and solving the standard system. in partial eigenvalue assignment, just a part of the open loop spectrum of the standard linear s...
متن کاملA Robust Control Design Technique for Discrete-Time Systems
A robust state feedback design subject to placement of the closed loop eigenvalues in a prescribed region of unit circle is presented. Quantitative measures of robustness and disturbance rejection are investigated. A stochastic optimization algorithm is used to effect trade-off between the free design parameters and to accomplish all the design criteria. A numerical example is given to illustra...
متن کاملGeneralized LMI observer design for discrete-time nonlinear descriptor models
The present paper provides a systematic way to generalize Takagi-Sugeno observer design for discrete-time nonlinear descriptor models. The approach is based on Finsler’s lemma, which decouples the observer gains from the Lyapunov function. The results are expressed as strict LMI constraints. To obtain more degrees of freedom without altering the number of LMI constraints and thus relax the cond...
متن کاملDissecting the FEAST algorithm for generalized eigenproblems
We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-known Rayleigh–Ritz method, we identify several critical issues that influence convergence and accuracy of the solver: the choice of the starting vector space, the stopping criterion, how the inner linear systems impac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1994
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)90372-7